A New Technique Enables Dynamic Replanning and

نویسندگان

  • Alexander Kott
  • Victor Saks
  • Albert Mercer
چکیده

We describe an application of a dynamic replanning technique in a highly dynamic and complex domain: the military aeromedical evacuation of patients to medical treatment facilities. U.S. Transportation Command (USTRANSCOM) is the DoD agency responsible for evacuating patients during wartime and peace. Doctrinally, patients requiring extended treatment must be evacuated by air to a suitable Medical Treatment Facility (MTF). The Persian Gulf war was the first significant armed conflict in which this concept has been put to a serious test. The results were far from satisfactory -about 60% of the patients ended up at the wrong destinations. In early 1993, the Department of Defense tasked USTRANSCOM to consolidate the command and control of medical regulation and aeromedical evacuation operations. The ensuing analysis led to TRAC2ES (TRANSCOM Regulating and Command and Control Evacuation System), a decision support system for planning and scheduling medical evacuation operations. Probably the most challenging aspect of the problem has to do with the dynamics of a domain in which requirements and constraints continuously change over time. Continuous dynamic replanning is a key capability of TRAC2ES. This paper describes the application and the AI approach we took in providing this capability.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Technique Enables Dynamic Replanning and Rescheduling of Aeromedical Evacuation

We describe an application of a dynamic replanning technique in a highly dynamic and complex domain: the military aeromedical evacuation of patients to medical treatment facilities. U.S. Transportation Command (USTRANSCOM) is the DoD agency responsible for evacuating patients during wartime and peace. Doctrinally, patients requiring extended treatment must be evacuated by air to a suitable Medi...

متن کامل

Repeated Sequential Single-Cluster Auctions with Dynamic Tasks for Multi-Robot Task Allocation with Pickup and Delivery

In this paper we study an extension of the multi-robot task allocation problem for online tasks requiring pickup and delivery. We extend our previous work on sequential single-cluster auctions to handle this more complex task allocation problem. Our empirical experiments analyse this technique in the domain of an environment with dynamic task insertion. We consider the trade-off between solutio...

متن کامل

Initial Experimental Results of Applying Continuity-guided Regeneration to Reactive Replanning and Rescheduling

We describe a reactive replanning technique developed to enable transportation planning in a highly dynamic, complex and critical domain: the military aeromedical evacuation of patients to medical treatment facilities. In early 1993, the Department of Defense tasked the U.S. Transportation Command (USTRANSCOM) to consolidate the command and control of medical regulation (assigning patients to m...

متن کامل

Continuity-guided Regeneration: an Approach to Reactive Replanning and Rescheduling

We describe a reactive replanning technique developed to enable transportation planning in a highly dynamic, complex and critical domain: the military aeromedical evacuation of patients to medical treatment facilities. In early 1993, the Department of Defense tasked the U.S. Transportation Command (USTRANSCOM) to consolidate the command and control of medical regulation (assigning patients to m...

متن کامل

A Light Formulation of the E∗ Interpolated Path Replanner

The E∗ algorithm is a path planning method capable of dynamic replanning and userconfigurable path cost interpolation, it results in more appropriate paths during gradient descent. The underlying formulation is based on interpreting navigation functions as a sampled continuous crossing-time map that takes into account a risk measure. Replanning means that changes in the environment model can be...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999